System Description : A Nuprl - PVS Connection : Integrating Libraries of Formal Mathematics ∗
نویسنده
چکیده
∗ This work was supported by ONR Grant N00014-01-1-0765 (Building Interactive Digital Libraries of Formal Algorithmic Knowledge) and by NSF Grant CCR 0204193 (Proof Automation in Constructive Type Theory). Abstract. We describe a link between the Nuprl and PVS proof systems that enables users to access PVS from the Nuprl theorem proving environment, to import PVS theories into the Nuprl library, and to browse both Nuprl and PVS theories in a unified formal framework. The combined system is a first step towards a digital library of formalized mathematics that can be shared and used in complex applications.
منابع مشابه
Innovations in computational type theory using Nuprl
For twenty years the Nuprl (“new pearl”) system has been used to develop software systems and formal theories of computational mathematics. It has also been used to explore and implement computational type theory (CTT) – a formal theory of computation closely related to Martin-Löf’s intuitionistic type theory (ITT) and to the calculus of inductive constructions (CIC) implemented in the Coq prov...
متن کاملThe Triumph of Types: Creating a Logic of Computational Reality
Type theory plays an essential role in computing and information science. It is the native language of several industrial strength interactive theorem provers including Coq, HOL, Isabelle, MetaPRL, Nuprl, PVS, and Twelf. These provers are used for building correct by construction software and for creating formalized mathematical theories whose logical correctness is assured to the highest stand...
متن کاملHybrid Interactive Theorem
In this paper we give the rst example of a signiicant piece of formal mathematics conducted in a hybrid of two diierent interactive systems. We constructively prove a theorem in Nuprl, from which a program can be extracted, but we use classical mathematics imported from HOL, and a connection to some of HOL's deenitional packages, for parts of the proof that do not contribute to the program.
متن کاملHybrid Interactive Theorem Proving Using Nuprl and HOL
In this paper we give the rst example of a signiicant piece of formal mathematics conducted in a hybrid of two diierent interactive systems. We constructively prove a theorem in Nuprl, from which a program can be extracted, but we use classical mathematics imported from HOL, and a connection to some of HOL's deenitional packages, for parts of the proof that do not contribute to the program.
متن کاملChapter 9 Publication / Citation : A Proof - Theoretic Approach to Mathematical Knowledge Management ∗
There are many real-life examples of formal systems that support certain constructions or proofs, but that do not provide direct support for remembering them so that they can be recalled and reused the future. This task is usually left to some metasystem that is typically provided as an afterthought. For example, programming language design usually focuses on the programming language itself; th...
متن کامل